Multilocal Programming and Applications
نویسندگان
چکیده
Multilocal programming aims to identify all local minimizers of unconstrained or constrained nonlinear optimization problems. The multilocal programming theory relies on global optimization strategies combined with simple ideas that are inspired in deflection or stretching techniques to avoid convergence to the already detected local minimizers. The most used methods to solve this type of problems are based on stochastic procedures and a population of solutions. In general, population-based methods are computationally expensive but rather reliable in identifying all local solutions. In this chapter, a review on recent techniques for multilocal programming is presented. Some real-world multilocal programming problems based on chemical engineering process design applications are described.
منابع مشابه
Stopping Rules Effect on a Derivative-Free Filter Multistart Algorithm for Multilocal Programming
1 Department of Mathematics, ESTiGInstitute Polytecnic of Bragança, Campus de Santa Apolónia, 5301-857 Bragança, Portugal [email protected] 2 Department of Mathematics and Applications, University of Minho, Guimarães, Portugal [email protected] 3 Centre of Mathematics, University of Minho, 4710-057 Braga, Portugal 4 Algoritmi R&D Centre, University of Minho, 4710-057 Braga, Portugal [email protected]...
متن کاملMultilocal Programming: A Derivative-Free Filter Multistart Algorithm
Multilocal programming aims to locate all the local solutions of an optimization problem. A stochastic method based on a multistart strategy and a derivative-free filter local search for solving general constrained optimization problems is presented. The filter methodology is integrated into a coordinate search paradigm in order to generate a set of trial approximations that might be acceptable...
متن کاملModern Computational Applications of Dynamic Programming
Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.
متن کاملA goal geometric programming problem (G2P2) with logarithmic deviational variables and its applications on two industrial problems
A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighte...
متن کاملMultilocal Creaseness Based on the Level-Set Extrinsic Curvature
Creases are a type of ridge/valley structures of an image characterized by local conditions. As creases tend to be at the center of anisotropic grey-level shapes, creaseness can be considered a measure of medialness, and therefore as useful in many image analysis problems. Among the several possibilities, a priori the creaseness based on the level-set extrinsic curvature (LSEC) is especially in...
متن کامل